Segmentation of Handprinted Letter Strings Using a Dynamic Programming Algorithm

نویسنده

  • Thomas M. Breuel
چکیده

Segmentation of handwritten input into individual characters is a crucial step in many connected handwriting recognition systems. This paper describes a segmentation algorithm for letters in Roman alphabets, curved pre-stroke cut (CPSC) segmentation. The CPSC algorithm evaluates large set of curved cuts through the image of the input string using dynamic programming and selects a small “optimal” subset of cuts for segmentation. It usually generates pixel accurate segmentations, indistinguishable from characters written in isolation. At four times oversegmentation, segmentation points are missed with an undetectable frequency on real-world databases. The CPSC algorithm has been used as part of a high-performance handwriting recognition system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition-based segmentation of on-line run-on handprinted words: Input vs. output segmentation

This paper reports on performance of two methods for recognition-based segmentation of strings of on-line handprinted capital Latin characters. The input strings consist of a time-ordered sequence of X-Y coordinates, punctuated by pen-lifts. The methods were designed to work in "run-on mode" where there is no constraint on the spacing between characters. While both methods use a neural network ...

متن کامل

Segmentation-Based Lyrics-Audio Alignment using Dynamic Programming

In this paper, we present a system for automatic alignment of textual lyrics with musical audio. Given an input audio signal, structural segmentation is first performed and similar segments are assigned a label by computing the distance between the segment pairs. Using the results of segmentation and hand-labeled paragraphs in lyrics as a pair of input strings, we apply a dynamic programming (D...

متن کامل

Identification of High Crash Road Segment using Genetic Algorithm and Dynamic Segmentation

This paper presents an evolutionary algorithm for recognizing high and low crash road segments using Genetic Algorithm as a dynamic segmentation method. Social and economic costs as well as physical and mental injuries make the governments perceiving to road safety indexes in order to diminish the consequences of road accidents. Due to the limitation of budget for safety...

متن کامل

Multi-oriented touching text character segmentation in graphical documents using dynamic programming

The touching character segmentation problem becomes complex when touching strings are multioriented. Moreover in graphical documents sometimes characters in a single-touching string have different orientations. Segmentation of such complex touching is more challenging. In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characte...

متن کامل

Computing Similarity between Rna Strings 1

Ribonucleic acid (RNA) strings are strings over the four-letter alphabet fA; C; G; Ug with a secondary structure of base-pairing between A 0 U and C 0 G pairs in the string. Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001